Sum-accelerated pseudospectral methods: the Euler-accelerated sinc algorithm
نویسندگان
چکیده
منابع مشابه
The Accelerated Euclidean Algorithm
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log n log log n) time complexity of the Schönhage algorithm for n-bit inputs. This new GCD algorithm is designed for both integers and polynomials. We only focus our study to the integer case, the polynomial case is currently addressed [3]. The algorithm is based on a half-gcd like pro...
متن کاملAn accelerated CLPSO algorithm
The particle swarm approach provides a low complexity solution to the optimization problem among various existing heuristic algorithms. Recent advances in the algorithm resulted in improved performance at the cost of increased computational complexity, which is undesirable. Literature shows that the particle swarm optimization algorithm based on comprehensive learning provides the best complexi...
متن کاملAccelerated Runge-Kutta Methods
Standard Runge-Kutta methods are explicit, one-step, and generally constant step-size numerical integrators for the solution of initial value problems. Such integration schemes of orders 3, 4, and 5 require 3, 4, and 6 function evaluations per time step of integration, respectively. In this paper, we propose a set of simple, explicit, and constant step-size Accerelated-Runge-Kutta methods that ...
متن کاملAccelerated Beam Tracing Algorithm
Determining early specular reflection paths is essential for room acoustics modeling. Beam tracing algorithms have been used to calculate these paths efficiently, thus allowing modeling of acoustics in real-time with a moving listener in simple, or complex but densely occluded, environments with a stationary sound source. In this paper it is shown that beam tracing algorithms can still be optim...
متن کاملAccelerated consensus via Min-Sum Splitting
•Common choice is Metropolis-Hastings: W M H i j = { 1/(2dmax) if {i , j } ∈ E 1−di /(2dmax) if i = j 0 otherwise •Rate of convergence is controlled by ρ(W −11T /n). • min{ρ(W −11T /n) : W symmetrical} is a convex problem (SDP). •Optimal matrix yields slow rate O(D2), achieved by W M H . •Lower-bound: Ω(D), where D is graph diameter. •To get fast rates, two approaches have been developed indepe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 1991
ISSN: 0168-9274
DOI: 10.1016/0168-9274(91)90065-8